Step of Proof: assert_of_lt_int
9,38
postcript
pdf
Inference at
*
2
I
of proof for Lemma
assert
of
lt
int
:
1.
x
:
2.
y
:
3.
x
<
y
x
<z
y
latex
by ((((Unfold `lt_int` 0)
CollapseTHEN (RWH (ReduceThenC (Auto_aux (first_nat 1:n) ((first_nat
C
1:n),(first_nat 4:n)) (first_tok :t) inil_term)) 0))
)
CollapseTHENA ((Auto_aux (first_nat 1:n
C
) ((first_nat 1:n),(first_nat 3:n)) (first_tok :t) inil_term)))
latex
C
1
:
C1:
tt
C
.
Definitions
P
Q
,
P
Q
,
t
T
,
True
,
T
,
,
P
Q
,
P
Q
,
i
<z
j
,
x
:
A
.
B
(
x
)
Lemmas
btrue
wf
,
bool
wf
,
true
wf
,
squash
wf
,
assert
wf
origin